Greedy Alternating Optimization for FHIM
نویسندگان
چکیده
This report investigates and examines the greedy alternating optimization procedures used for solving the non-convex optimization problem of our Factorized High order Interactions Model (FHIM) model.
منابع مشابه
A hybrid metaheuristic using fuzzy greedy search operator for combinatorial optimization with specific reference to the travelling salesman problem
We describe a hybrid meta-heuristic algorithm for combinatorial optimization problems with a specific reference to the travelling salesman problem (TSP). The method is a combination of a genetic algorithm (GA) and greedy randomized adaptive search procedure (GRASP). A new adaptive fuzzy a greedy search operator is developed for this hybrid method. Computational experiments using a wide range of...
متن کاملAn Iterated Greedy Algorithm for Flexible Flow Lines with Sequence Dependent Setup Times to Minimize Total Weighted Completion Time
This paper explores the flexile flow lines where setup times are sequence- dependent. The optimization criterion is the minimization of total weighted completion time. We propose an iterated greedy algorithm (IGA) to tackle the problem. An experimental evaluation is conducted to evaluate the proposed algorithm and, then, the obtained results of IGA are compared against those of some other exist...
متن کاملThe Supporting Halfspace-Quadratic Programming Strategy for the Dual of the Best Approximation Problem
Algorithms for projecting a point onto the intersection of convex sets are useful subroutines for solving optimization problems with constraints. One such algorithm is the Dykstra's algorithm, which is known to be alternating minimization on the dual problem. The projection onto each convex set generates a halfspace supporting the set. It is also relatively easy to project onto the intersection...
متن کاملThe Alternating Greedy Expansion and Applications to Left-to-right Algorithms in Cryptography
In [4], we introduced the alternating greedy expansion of integers, which turned out to be useful in several left-to-right algorihms in cryptography. In this paper, we collect known results about this alternating greedy expansion and complement it with other useful properties and algorithms. In the second part, we apply it to give an algorithm for computing a joint expansion of d integers of mi...
متن کاملThe alternating greedy expansion and applications to computing digit expansions from left-to-right in cryptography
The central topic of this paper is the alternating greedy expansion of integers, which is defined to be a binary expansion with digits {0,±1} with the property that the nonzero digits have alternating signs. We collect known results about this alternating greedy expansion and complement it with other useful properties and algorithms. In the second part, we apply it to give an algorithm for comp...
متن کامل